/*
 * Copyright (c) 2006-2007 Zsolt Szasz <zsolt at lorecraft dot com>
 * 
 * Permission is hereby granted, free of charge, to any person obtaining
 * a copy of this software and associated documentation files (the
 * "Software"), to deal in the Software without restriction, including
 * without limitation the rights to use, copy, modify, merge, publish,
 * distribute, sublicense, and/or sell copies of the Software, and to
 * permit persons to whom the Software is furnished to do so, subject to
 * the following conditions:
 * 
 * The above copyright notice and this permission notice shall be
 * included in all copies or substantial portions of the Software.
 * 
 * THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
 * EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
 * MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
 * NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE
 * LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION
 * OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION
 * WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
 */

package org.lorecraft.routes;

public class ProcessingContext {

	private final String[] elementStrings;
	private final RouteMapping routeMapping;
	private int currIndex = 0;

	public ProcessingContext(String[] elementStrings, RouteMapping routeMapping) {
		this.elementStrings = elementStrings;
		this.routeMapping = routeMapping;
	}

	String[] getElementStrings() {
		return elementStrings;
	}

	RouteMapping getRouteMapping() {
		return routeMapping;
	}

	public boolean hasMoreElements() {
		return currIndex < elementStrings.length;
	}

	public String getCurrentElementString() {
		return elementStrings[currIndex];
	}

	public void advance() {
		currIndex++;
	}

	public String[] remainingElements() {
		if (!hasMoreElements()) {
			return new String[] {};
		}
		String[] remaining = new String[elementStrings.length - currIndex];
		for (int i = currIndex; i < elementStrings.length; i++) {
			remaining[i - currIndex] = elementStrings[i];
		}
		return remaining;
	}

	public void advanceToEnd() {
		currIndex = elementStrings.length;		
	}

}
